When do agents outperform centralized algorithms?
نویسندگان
چکیده
منابع مشابه
Do Probabilistic Algorithms Outperform Deterministic Ones?
The introduction of randomization into efficient computation has been one of the most fertile and usefifl ide,'~q in computer science. In cryl)tography and ,~synchronous comlmting, randomization makes possil)le t.asks that are iml)ossilfle to l)erform detcrnfinistically. For fimction coml)utation , many examples are known in which randomization allows considerable savings in resources like spac...
متن کاملCan Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent
Most distributed machine learning systems nowadays, including TensorFlow and CNTK, are built in a centralized fashion. One bottleneck of centralized algorithms lies on high communication cost on the central node. Motivated by this, we ask, can decentralized algorithms be faster than its centralized counterpart? Although decentralized PSGD (D-PSGD) algorithms have been studied by the control com...
متن کاملWhen do markets with simple agents fail?
We consider (prediction) markets where myopic agents sequentially interact with an automated market maker. We show a broad negative result: by varying the order of participation, the market’s aggregate prediction can converge to an arbitrary value. In other words, markets may fail to do any meaningful belief aggregation. On the positive side, we show that under a random participation model, ste...
متن کاملRecent Progress in Quantum Algorithms What Quantum Algorithms Outperform Classical Computation and How Do They Do It?
notion of the algorithm—the quantum algorithm—whose computational power appears to be fundamentally more efficient at carrying out certain tasks than algorithms written for today’s, nonquantum, computers. Could this possibly be true: that there is a more fundamental notion of algorithmic efficiency for computers built from quantum components? And, if this is true, what exactly is the power of t...
متن کاملWhen Does a Pair Outperform Two Individuals?
This paper reports experimental measurements of productivity and quality in pair programming. The work complements Laurie Williams’ work on collaborative programming, in which Pair Programming and Solo Programming student groups wrote the same programs and then their activities were measured to investigate productivity, quality, etc. In this paper, Pair and Solo industrial programmer groups are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Agents and Multi-Agent Systems
سال: 2017
ISSN: 1387-2532,1573-7454
DOI: 10.1007/s10458-017-9371-y